Dense Sδ-diagonals and linearly ordered extensions

Linearly Ordered Topological Spaces

This work is devoted to the study of certain cardinality modifications of paracompactness and compactness in the setting of linearly ordered spaces. Some of the concepts treated here have previously been studied by Aquaro [l]1, Gulden [4], Kennison [5], Mansfield [6], Morita [7], and Poppe [9]. On the other hand, the concept of m-boundedness, introduced in §2, is new. Our main results (Theorems...

Ordered Tableaux: Extensions and Applications

In this paper several conceptual extensions to the theory of order-restricted free variable clausal tableaux which was initiated in 9, 8] are presented: atom orderings are replaced by the more general concept of a selection function, the substitutivity condition required for lifting is for certain variants of the calculus replaced by a much weaker assumption, and a rst version of order-restrict...

Extensions of Ordered Groups1

Parsing Using Linearly Ordered Phonological Rules

A generate and test algorithm is described which parses a surface form into one or more lexical entries using linearly ordered phonological rules. This algorithm avoids the exponential expansion of search space which a naive parsing algorithm would face by encoding into the form being parsed the ambiguities which arise during parsing. The algorithm has been implemented and tested on real langua...

On Programs with Linearly Ordered Multiple Preferences

The extended answer set semantics for logic programs allows for the defeat of rules to resolve contradictions. We propose a refinement of these semantics based on a preference relation on extended literals. This relation, a strict partial order, induces a partial order on extended answer sets. The preferred answer sets, i.e. those that are minimal w.r.t. the induced order, represent the solutio...